An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
نویسندگان
چکیده
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Evolutionary Algorithm (EA). Use of an attribute grammar allows GE to maintain context-sensitive and semantic information pertinent to the capacity constraints of the 01 Multiconstrained Knapsack Problem (MKP). An attribute grammar specification is used to perform decoding similar to a first-fit heuristic. The results presented are encouraging, demonstrating that GE in conjunction with attribute grammars can provide an improvement over the standard context-free mapping process for problems in this domain.
منابع مشابه
An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem
This paper presents an improved hybrid Genetic Algorithm (GA) for solving the Multiconstrained 0–1 Knapsack Problem (MKP). Based on the solution of the LP-relaxed MKP, an efficient pre-optimization of the initial population is suggested. Furthermore, the GA uses sophisticated repair and local improvement operators which are applied to each newly generated solution. Care has been taken to define...
متن کاملSolving Knapsack Problems with Attribute Grammars
We present a work in progress describing attribute grammar approaches to Grammatical Evolution, which allow us to encode context-sensitive and semantic information. Performance of the different grammars adopted are directly compared with a more traditional GA representation on five instances of an NP-hard knapsack problem. The results presented are encouraging, demonstrating that Grammatical Ev...
متن کاملA parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems
A mathematical programming approach to deal with the global configuration of resource constraints is presented. A specialized parametric programming algorithm to obtain the pareto set for the biobjective problem that appears to deal with the global configuration for 0-1-Integer Linear Programing problems is presented and implemented. Computational results for Multiconstrained Knapsack problems ...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کامل